This is a combinatorial problem in canonical form . 這是組合論中的典型問(wèn)題。
Inter - relations among collaborative discussion , meta - cognitive control and successful solution in combinatorial problem 合作討論和元認(rèn)知監(jiān)控與排列組合問(wèn)題的解決
Adleman , l . m . " molecular computation of solutions to combinatorial problems . " science 266 ( 5187 ) ( 11 nov 1994 ) : 1021 - 4 組合問(wèn)題的分子運(yùn)算解決方法. " 。期刊科學(xué)第266卷。第1024到1024頁(yè)。
This paper presents the mathematical model and the general algorithms of transforming combinatorial problem into state space search 本文提出了將組合問(wèn)題歸結(jié)為狀態(tài)空間搜索問(wèn)題的數(shù)學(xué)模型和通用算法。
Because the design of state space of the combinatorial problem is much easier than design of the searching algorithm , the present of the general searching algorithm is the apparent progress for the searching technology 因?yàn)榻M合問(wèn)題的狀態(tài)空間表示比原來(lái)的搜索求解容易的多,通用搜索算法的提出是搜索技術(shù)的一個(gè)明顯的進(jìn)步。